Torsional pendulum with small time constant
نویسندگان
چکیده
منابع مشابه
Small-space encoding LCE data structure with constant-time queries
The longest common extension (LCE) problem is to preprocess a given string w of length n so that the length of the longest common prefix between suffixes of w that start at any two given positions is answered quickly. In this paper, we present a data structure of O(zτ + n τ ) words of space which answers LCE queries in O(1) time and can be built in O(n log σ) time, where 1 ≤ τ ≤ √ n is a parame...
متن کاملSimple pendulum determination of the gravitational constant.
We determined the Newtonian constant of gravitation G by interferometrically measuring the change in spacing between two free-hanging pendulum masses caused by the gravitational field from large tungsten source masses. We find a value for G of (6.672 34±0.000 14)×10(-11) m3 kg(-1) s(-2). This value is in good agreement with the 1986 Committee on Data for Science and Technology (CODATA) value...
متن کاملConstant-Time Callees with Variable-Time Callers
Side-channel attacks are a serious threat to securitycritical software. To mitigate remote timing and cachetiming attacks, many ubiquitous cryptography software libraries feature constant-time implementations of cryptographic primitives. In this work, we disclose a vulnerability in OpenSSL 1.0.1u that recovers ECDSA private keys for the standardized elliptic curve P-256 despite the library feat...
متن کاملA simple pendulum laser interferometer for determining the gravitational constant.
We present a detailed account of our 2004 experiment to measure the Newtonian constant of gravitation with a suspended laser interferometer. The apparatus consists of two simple pendulums hanging from a common support. Each pendulum has a length of 72 cm and their separation is 34 cm. A mirror is embedded in each pendulum bob, which then in combination form a Fabry-Perot cavity. A laser locked ...
متن کاملQcBits: Constant-Time Small-Key Code-Based Cryptography
This paper introduces a constant-time implementation for a quasi-cyclic moderate-density-parity-check (QC-MDPC) code based encryption scheme. At a 2 security level, the software takes 14 679 937 Cortex-M4 and 1 560 072 Haswell cycles to decrypt a short message, while the previous records were 18 416 012 and 3 104 624 (non-constant-time) cycles. Such speed is achieved by combining two techniques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Journal of Physics
سال: 1958
ISSN: 0011-4626,1572-9486
DOI: 10.1007/bf01603705